2008 / 18 ■ Axiomatic resource allocation for heterogeneous agents
نویسندگان
چکیده
We analyze a model of resource allocation in which agents' abilities (to transform the resource into an interpersonally comparable outcome) and initial endowments may differ. We impose ethical and operational axioms in this model and characterize some allocation rules as a result of combining these axioms. Two focal (and polar) egalitarian rules are singled out. On the one hand, the rule that allocates the resource equally across agents. On the other hand, the rule tha allocates the resource so that the distribution of final outcomes is lexicographically maximized.
منابع مشابه
Axiomatic resource allocation for heterogeneous agents ∗
We analyze a model of resource allocation in which agents’ abilities (to transform the resource into an interpersonally comparable outcome) and initial endowments may differ. We impose ethical and operational axioms in this model and characterize some allocation rules as a result of combining these axioms. Two focal (and polar) egalitarian rules are singled out. On the one hand, the rule that a...
متن کاملJointly power and bandwidth allocation for a heterogeneous satellite network
Due to lack of resources such as transmission power and bandwidth in satellite systems, resource allocation problem is a very important challenge. Nowadays, new heterogeneous network includes one or more satellites besides terrestrial infrastructure, so that it is considered that each satellite has multi-beam to increase capacity. This type of structure is suitable for a new generation of commu...
متن کاملOptimal allocation of heterogeneous resources in cooperative control scenarios
This paper introduces a mathematical framework for the study of resource allocation problems involving the deployment of heterogeneous agents to different teams. In this context, the term heterogeneous is used to describe classes of agents that differ in the basic functions they can perform (e.g., one type of agent searches for targets while another type engages those targets). The problem is a...
متن کاملCol.lecció d’Economia E17/363 Games with Graph Restricted Communication and Levels Structure of Cooperation
We analyze surplus allocation problems where cooperation between agents is restricted both by a communication graph and by a sequence of embedded partitions of the agent set. For this type of problem, we define and characterize two new values extending the Shapley value and the Banzhaf value respectively. Our results enable the axiomatic comparison between the two values and provide some basic ...
متن کاملThree New Complexity Results for Resource Allocation Problems
We prove the following results for task allocation of indivisible resources: • The problem of finding a leximin-maximal resource allocation is in P if the agents have max-utility functions and atomic demands. • Deciding whether a resource allocation is Pareto-optimal is coNP-complete for agents with (1-)additive utility functions. • Deciding whether there exists a Pareto-optimal and envy-free r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008